A Fast Updatable Implementation of Index Generation Functions Using Multiple IGUs
نویسنده
چکیده
This paper presents a method to realize index generation functions using multiple Index Generation Units (IGUs). The architecture implements index generation functions more efficiently than a single IGU when the number of registered vectors is very large. This paper proves that independent linear transformations are necessary in IGUs for efficient realization. Experimental results confirm this statement. Finally, it shows a fast update method to IGUs. key words: random function, CAM, content-addressable memory, linear decomposition, linear transformation, statistical analysis, update method
منابع مشابه
A Fast and Self-Repairing Genetic Programming Designer for Logic Circuits
Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...
متن کاملExact Closed-Form Solution for Vibration Analysis of Truncated Conical and Tapered Beams Carrying Multiple Concentrated Masses
In this paper, an exact closed-form solution is presented for free vibration analysis of Euler-Bernoulli conical and tapered beams carrying any desired number of attached masses. The concentrated masses are modeled by Dirac’s delta functions which creates no need for implementation of compatibility conditions. The proposed technique explicitly provides frequency equation and corresponding mode ...
متن کاملAn Efficient Heuristic Algorithm for Linear Decomposition of Index Generation Functions
This paper proposes a heuristic algorithm for linear decomposition of index generation functions using a balanced decision tree. The proposed algorithm finds a good linear decomposition of an index generation function by recursively dividing a set of its function values into two subsets with balanced size. Since the proposed algorithm is fast and requires a small amount of memory, it is applica...
متن کاملZero-Forcing Equalizer based on Fast One Sided Jacobi Algorithm for MIMO PLC Systems
In this paper, we investigate the Zero-Forcing equalizer based on Fast One Sided Jacobi (ZF-FOSJ) algorithm for the Multiple Input Multiple Output Power Line Communication (MIMO PLC) systems. The proposed algorithm determines the pseudo-inverse of estimated channel matrix using only real matrix and operations free from trigonometric functions. The hardware implementation complexity is reduced c...
متن کاملA Low-Cost and High-Performance Virus Scanning Engine Using a Binary CAM Emulator and an MPU
This paper shows a virus scanning engine using two-stage matching. In the first stage, a binary CAM emulator quickly detects a part of the virus pattern, while in the second stage, the MPU detects the full length of the virus pattern. The binary CAM emulator is realized by four index generation units (IGUs). The proposed system uses four off chip SRAMs and a small FPGA. Thus, the cost and the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 100-D شماره
صفحات -
تاریخ انتشار 2017